Graph concatenation for quantum codes

Graph concatenation for quantum codes

Graph concatenation for quantum codes Salman Beigi,1 Isaac Chuang,2 Markus Grassl,3 Peter Shor,4 and Bei Zeng5,6,a) 1Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125, USA 2Department of Physics and Department of Electric Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA 3Centre for Quantu...

CMU Quantum Information Seminar Graph Structure of Quantum Codes

More Sparse-Graph Codes for Quantum Error-Correction

We use Cayley graphs to construct several dual-containing codes, all of which have sparse graphs. These codes’ properties are promising compared to other quantum error-correcting codes. This paper builds on the ideas of the earlier paper Sparse-Graph Codes for Quantum ErrorCorrection (quant-ph/0304161), which the reader is encouraged to refer to. To recap: Our aim is to make classical error-cor...

Concatenation of Space-Time Block Codes with Convolutional Codes

(ABSTRACT) Multiple antennas help in combating the destructive effects of fading as well as improve the spectral efficiency of a communication system. Receive diversity techniques like maximal ratio receive combining have been popular means of introducing multiple antennas into communication systems. Space-time block codes present a way of introducing transmit diversity into the communication s...

Lecture 4: Codes based on Concatenation

In the last lecture, we studied codes based on univarite polynomials, also known as Reed-Solomon codes, and on multivariate polynomials, also known as Reed-Muller codes. The Reed-Solomon codes had rate R = 1 − δ, which is optimal (given by the Singleton bound), but required alphabets of large size (|Σ| ≥ n). Multivariate polynomials in a constant number of variables, however, gave codes of posi...